An Equational Metalogic for Monadic Equational Systems
نویسنده
چکیده
The paper presents algebraic and logical developments. From the algebraic viewpoint, we introduce Monadic Equational Systems as an abstract enriched notion of equational presentation. From the logical viewpoint, we provide Equational Metalogic as a general formal deductive system for the derivability of equational consequences. Relating the two, a canonical model theory for Monadic Equational Systems is given and for it the soundness of Equational Metalogic is established. This development involves a study of clone and double-dualization structures. We also show that in the presence of free algebras the model theory of Monadic Equational Systems satisfies an internal strong-completeness property.
منابع مشابه
FUZZY EQUATIONAL CLASSES ARE FUZZY VARIETIES
In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...
متن کاملDecidability and Complexity of Finitely Closable Linear Equational Theories
We deene a subclass of the class of linear equational theories, called nitely closable linear theories. We consider uniication problems with no repeated variables. We show the decidability of this subclass, and give an algorithm in PSPACE. If all function symbols are monadic, then the running time is in NP, and quadratic for unitary monadic nitely closable linear theories.
متن کاملF . Jacquemard , M . Rusinowitch and L . Vigneron Tree automata with equality constraints modulo equational theories Research Report LSV - 05 - 16 August 2005
This paper presents new classes of tree automata combining automata with equality test with automata modulo equational theories. These tree automata are obtained by extending their standard Horn clause representations with equational conditions and monadic rewrite systems. We show in particular that the general membership problem is decidable by proving that the saturation of tree automata pres...
متن کاملSpectra and Systems of Equations
Periodicity properties of sets of nonnegative integers, defined by systems Y = G(Y) of equations, are analyzed. Such systems of set equations arise naturally from equational specifications of combinatorial classes— Compton’s equational specification of monadic second order classes of trees is an important example. In addition to the general theory of set equations and periodicity, with several ...
متن کاملSEQUENTIALLY COMPACT S-ACTS
The investigation of equational compactness was initiated by Banaschewski and Nelson. They proved that pure injectivity is equivalent to equational compactness. Here we define the so called sequentially compact acts over semigroups and study some of their categorical and homological properties. Some Baer conditions for injectivity of S-acts are also presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013